A characterization of Kruskal sharing rules for minimum cost spanning tree problems
نویسندگان
چکیده
منابع مشابه
Sequential contributions rules for minimum cost spanning tree problems
We introduce a family of sequential contributions rules for minimum cost spanning tree problems. Each member of the family assigns an agent some part of his immediate connection cost and all of his followers are equally responsible for the remaining part. We characterize the family by imposing the axioms of efficiency, non-negativity, independence of following costs, group independence, and wea...
متن کاملThe Filter-Kruskal Minimum Spanning Tree Algorithm
We present Filter-Kruskal – a simple modification of Kruskal’s algorithm that avoids sorting edges that are “obviously” not in the MST. For arbitrary graphs with random edge weights, Filter-Kruskal runs in time O ( m + n log n log m n ) , i.e. in linear time for not too sparse graphs. Experiments indicate that the algorithm has very good practical performance over the entire range of edge densi...
متن کاملReload cost problems: minimum diameter spanning tree
We examine a network design problem under the reload cost model. Given an undirected edge colored graph, reload costs on a path arise at a node where the path uses consecutive edges of di(erent colors. We consider the problem of 0nding a spanning tree of minimum diameter with respect to the reload costs. We present lower bounds for the approximability even on graphs with maximum degree 5. On th...
متن کاملThe family of cost monotonic and cost additive rules in minimum cost spanning tree problems
In this paper we define a new family of rules in minimum cost spanning tree problems related with Kruskal’s algorithm. We characterize this family with a cost monotonicity property and a cost additivity property. Adding the property of core selection (or separability) to the previous characterization, we obtain the family of obligation rules defined in Tijs et al (2006).
متن کاملA Metaheuristic Algorithm for the Minimum Routing Cost Spanning Tree Problem
The routing cost of a spanning tree in a weighted and connected graph is defined as the total length of paths between all pairs of vertices. The objective of the minimum routing cost spanning tree problem is to find a spanning tree such that its routing cost is minimum. This is an NP-Hard problem that we present a GRASP with path-relinking metaheuristic algorithm for it. GRASP is a multi-start ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Game Theory
سال: 2008
ISSN: 0020-7276,1432-1270
DOI: 10.1007/s00182-008-0147-0